package _18_剑指OfferII;

public class _088_剑指OfferII爬楼梯的最少成本 {

    public static void main(String[] args) {

        _088_剑指OfferII爬楼梯的最少成本 v = new _088_剑指OfferII爬楼梯的最少成本();

        int[] ins = {1, 100, 1, 1, 1, 100, 1, 1, 100, 1};
        System.out.println(v.minCostClimbingStairs(ins));

    }

    public int minCostClimbingStairs(int[] cost) {
        int len = cost.length;
        int[] dp = new int[len + 1];

        for (int i = 2; i <= len; i++) {
            dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
        }
        return dp[len];
    }

}
